Two-factors with few cycles in claw-free graphs
نویسندگان
چکیده
Let G be a graph of order n. De.ne fk(G) (Fk(G)) to be the minimum (maximum) number of components in a k-factor of G. For convenience, we will say that fk(G)=0 if G does not contain a k-factor. It is known that if G is a claw-free graph with su4ciently high minimum degree and proper order parity, then G contains a k-factor. In this paper we show that f2(G)6n= for n and su4ciently large and G claw-free. In addition, we consider F2(G) for claw-free graphs and look at the potential range for the number of cycles in a 2-factor. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
On cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کامل2-Factors in Hamiltonian Graphs
We show that every hamiltonian claw-free graph with a vertex x of degree d(x) ≥ 7 has a 2-factor consisting of exactly two cycles.
متن کامل2-factors with Bounded Number of Components in Claw-free Graphs
In this paper, we show that every 3-connected claw-free graph G has a 2-factor having at most max { 2 5(α+1), 1 } cycles, where α is the independence number of G. As a corollary of this result, we also prove that every 3-connected claw-free graph G has a 2-factor with at most ( 4|G| 5(δ+2)+ 2 5 ) cycles, where δ is the minimum degree of G. This is an extension of a known result on the number of...
متن کاملMinimum degree and disjoint cycles in generalized claw-free graphs
For s ≥ 3 a graph is K1,s-free if it does not contain an induced subgraph isomorphic to K1,s. Cycles in K1,3-free graphs, called clawfree graphs, have beenwell studied. In this paper we extend results on disjoint cycles in claw-free graphs satisfying certain minimum degree conditions to K1,s-free graphs, normally called generalized claw-free graphs. In particular, we prove that if G is K1,s-fre...
متن کاملClosure operation for even factors on claw-free graphs
Ryjacek [Z. Ryjáček: On a closure concept in claw-free graphs. Journal of Combinatorial Theory Ser. B 70 (1997), 217-224] defined a powerful closure operation cl(G) on claw-free graphs G. Very recently, Ryjacek, Yoshimoto and the talker developed the closure operation cl (G) on claw-free graphs which preserves the (non)-existence of a 2-factor. In this talk, we introduce a closure operation cl(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 231 شماره
صفحات -
تاریخ انتشار 2001